Schur dynamics of the Schur processes

Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions

In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F -multiplicity free. Combinatorially, this is equivalent to classifying all skew shapes whose standard Young tableaux have distinct descent sets. We then generalize our setting, and classify all F -multiplicity free quasisy...

Products of Schur and Factorial Schur Functions

The product of any finite number of Schur and factorial Schur functions can be expanded as a Z[y]-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes the classical Littlewood-Richardson rule.

Equality of Schur and Skew Schur Functions

We determine the precise conditions under which any skew Schur function is equal to a Schur function over both infinitely and finitely many variables.

Schur-Pair Property and the Structure of Varietal Covering Groups

Perfect sampling algorithm for Schur processes

We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tili...